package hash;

import java.util.Collection;
import java.util.HashMap;
import java.util.Map;
import java.util.Set;
import java.util.concurrent.ConcurrentHashMap;

public class DiyConcurrentHashMap<K, V>  implements Map {




    volatile Node<K, V>[] table;






    //基于数组 和 hash

    //可扩容

    //ConcurrentHashMap

    //HashMap


    @Override
    public int size() {
        return 0;
    }

    @Override
    public boolean isEmpty() {
        return table.length>0;
    }

    @Override
    public boolean containsKey(Object o) {
        return false;
    }

    @Override
    public boolean containsValue(Object o) {
        return false;
    }

    @Override
    public Object get(Object o) {
        return null;
    }

    @Override
    public Object put(Object o, Object o2) {

        //计算Hash

        //获取下表


        //加入节点然后移动

        return null;
    }

    @Override
    public Object remove(Object o) {
        return null;
    }

    @Override
    public void putAll(Map map) {

    }

    @Override
    public void clear() {

    }

    @Override
    public Set keySet() {
        return null;
    }

    @Override
    public Collection values() {
        return null;
    }

    @Override
    public Set<Entry> entrySet() {
        return null;
    }



}
